Storage system with write-via-hash functionality for synchronous replication of logical storage volumes

ABSTRACT

An apparatus includes a processing device comprising a processor coupled to a memory. The processing device is configured, in conjunction with synchronous replication of at least one logical storage volume between first and second storage systems, to receive a synchronous write request comprising a data page to be written to the logical storage volume, to determine a content-based signature for the data page, and to send the content-based signature from the first storage system to the second storage system. Responsive to receipt in the first storage system of an indication from the second storage system that the data page having the content-based signature is not already present in the second storage system, the processing device is further configured to send the data page from the first storage system to the second storage system. The processing device in some embodiments implements a distributed storage controller of a content addressable storage system.

FIELD

The field relates generally to information processing systems, and more particularly to storage in information processing systems.

BACKGROUND

Many information processing systems are configured to replicate data from one storage system to another storage system, possibly at different physical sites. In some cases, such arrangements are utilized to support disaster recovery functionality within the information processing system. For example, an enterprise may replicate data from a production data center to a disaster recovery data center. In the event of a disaster at the production site, applications can be started at the disaster recovery site using the data that has been replicated to that site so that the enterprise can continue its business.

Data replication in these and other contexts can be implemented using asynchronous replication at certain times and synchronous replication at other times. For example, asynchronous replication may be configured to periodically transfer data in multiple cycles from a source site to a target site, while synchronous replication may be configured to mirror host writes from the source site to the target site as the writes are made at the source site. Storage systems participating in a replication process can therefore each be configured to support both asynchronous and synchronous replication modes.

In synchronous replication, a given host write is typically acknowledged back to the host by the source site only after that host write has been transmitted by the source site to the target site and acknowledged back to the source site by the target site. Unfortunately, such arrangements can create a significant penalty on host writes, by adding delay that increases with link distance, write size and network load.

Accordingly, a need exists for techniques that can substantially accelerate host writes in the content of synchronous replication, while also conserving scarce system resources such as network bandwidth.

SUMMARY

Illustrative embodiments provide techniques for implementing what is referred to herein as “write-via-hash” functionality in conjunction with synchronous replication of one or more logical storage volumes from a source storage system to a target storage system.

These and other embodiments disclosed herein can advantageously accelerate host writes and thereby substantially reduce the significant penalties that might otherwise occur for host writes in synchronous replication. Moreover, such embodiments can balance the needs of multiple synchronous replication sessions with currently-available network bandwidth, taking into consideration their respective distinct deduplication rates and their associated potential savings from use of write-via-hash.

A given source or target storage system in some embodiments disclosed herein illustratively comprises a clustered implementation of a content addressable storage (CAS) system having a distributed storage controller. Similar advantages can be provided in other types of storage systems.

In one embodiment, an apparatus includes at least one processing device comprising a processor coupled to a memory, with the processing device being configured, in conjunction with synchronous replication of at least one logical storage volume between first and second storage systems, to receive a synchronous write request comprising a data page to be written to the logical storage volume, to determine a content-based signature for the data page, and to send the content-based signature from the first storage system to the second storage system. Responsive to receipt in the first storage system of an indication from the second storage system that the data page having the content-based signature is not already present in the second storage system, the processing device is further configured to send the data page from the first storage system to the second storage system.

The first and second storage systems illustratively comprise respective source and target storage systems of the synchronous replication of said at least one logical storage volume, although the designation of the first storage system as the source and the second storage system as the target can be reversed in other embodiments.

The content-based signature for the data page illustratively comprises a full hash digest of the data page, also referred to herein as a “hash” of the data page, and is determined based at least in part on application of a secure hashing algorithm to content of the data page. Such a hash is an example of a content-based signature, and is used to perform a write-via-hash attempt in conjunction with synchronous replication in illustrative embodiments.

The second storage system, responsive to determining that the data page having the content-based signature is already present in the second storage system, illustratively completes the synchronous write request in the second storage system utilizing the content-based signature. Such operations illustratively occur in conjunction with a successful instance of a write-via-hash attempt for the synchronous write request.

The second storage system, responsive to receipt of the data page from the first storage system, illustratively completes the synchronous write request in the second storage system utilizing the received data page. Such operations illustratively occur in conjunction with an unsuccessful instance of a write-via-hash attempt for the synchronous write request.

In some embodiments, the synchronous replication comprises a plurality of synchronous replication sessions each involving one or more logical storage volumes, with different ones of the synchronous replication sessions being assigned different ones of a plurality of distinct priority levels.

Each of the synchronous replication sessions in these and other embodiments can independently determine whether or not to first send a content-based signature for a data page of a synchronous write request to the second storage system instead of first sending the data page, in order to determine if the data page already exists in the second storage system so as to thereby potentially avoid sending the data page.

In some embodiments, each of one or more of the synchronous replication sessions has a deduplication threshold and is configured to initially process a designated amount of its synchronous write requests by first sending content-based signatures for respective data pages of the synchronous write requests to the second storage system instead of first sending the data pages, in order to determine if the data pages already exist in the second storage system so as to thereby potentially avoid sending the data pages. The session determines an initial value of a deduplication ratio based at least in part on results of the initial processing.

For each of a plurality of additional synchronous write requests, responsive to a current value of the deduplication ratio being above the deduplication threshold, the processing device first sends a content-based signature for a data page of the synchronous write request to the second storage system instead of first sending the data page, in order to determine if the data page already exists in the second storage system so as to thereby potentially avoid sending the data page, and responsive to a current value of the deduplication ratio not being above the deduplication threshold, the processing device first sends the data page.

In some embodiments, the deduplication thresholds are assigned to respective ones of the synchronous replication sessions based at least in part on their respective priority levels such that a session having a relatively high priority is assigned a relatively high deduplication threshold.

Additionally or alternatively, one or more of the deduplication thresholds are reduced responsive to a detected increase in network congestion between the first and second storage systems.

In some embodiments, the first and second storage systems comprise respective CAS systems having respective sets of non-volatile memory storage devices. For example, the first and second storage systems are illustratively associated with respective source and target sites of a replication process, with the source site comprising a production site data center and the target site comprising a disaster recovery site data center, although a wide variety of other arrangements are possible.

The processing device in some embodiments comprises at least a portion of a storage controller of one of the first and second storage systems.

As another example, the processing device illustratively comprises at least one of a plurality of storage nodes of a distributed storage system, with each such storage node comprising a set of processing modules configured to communicate with corresponding sets of processing modules on other ones of the storage nodes. The sets of processing modules of the storage nodes of the distributed storage system collectively comprise at least a portion of a storage controller of the storage system.

Numerous other clustered and non-clustered storage system arrangements are possible in other embodiments.

These and other illustrative embodiments include, without limitation, apparatus, systems, methods and processor-readable storage media.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram of an information processing system comprising source and target storage systems configured with write-via-hash functionality in synchronous replication in an illustrative embodiment.

FIG. 2 shows an example of a distributed CAS system that illustratively represents one of the source and target storage systems of FIG. 1 in some embodiments.

FIG. 3 shows an example relationship between routing, control and data modules of a CAS system in an illustrative embodiment.

FIGS. 4A, 4B and 4C are flow diagrams showing respective algorithms utilized to provide different aspects of write-via-hash functionality in synchronous replication in illustrative embodiments.

FIGS. 5 and 6 show examples of processing platforms that may be utilized to implement at least a portion of an information processing system in illustrative embodiments.

DETAILED DESCRIPTION

Illustrative embodiments will be described herein with reference to exemplary information processing systems and associated computers, servers, storage devices and other processing devices. It is to be appreciated, however, that these and other embodiments are not restricted to the particular illustrative system and device configurations shown. Accordingly, the term “information processing system” as used herein is intended to be broadly construed, so as to encompass, for example, processing systems comprising cloud computing and storage systems, as well as other types of processing systems comprising various combinations of physical and virtual processing resources. An information processing system may therefore comprise, for example, at least one data center or other cloud-based system that includes one or more clouds hosting multiple tenants that share cloud resources. Numerous different types of enterprise computing and storage systems are also encompassed by the term “information processing system” as that term is broadly used herein.

FIG. 1 shows an information processing system 100 configured in accordance with an illustrative embodiment. The information processing system 100 comprises a plurality of host devices 101, a source storage system 102S and a target storage system 102T, all of which are configured to communicate with one another over a network 104. The source and target storage systems 102 are more particularly configured in this embodiment to participate in a synchronous replication process in which one or more storage volumes are synchronously replicated from the source storage system 102S to the target storage system 102T, possibly with involvement of at least one of the host devices 101. The one or more storage volumes that are synchronously replicated from the source storage system 102S to the target storage system 102T are illustratively part of a designated consistency group.

The synchronous replication process can be initiated from another replication process of a different type, such as an asynchronous replication process. Accordingly, the storage systems 102 can transition from asynchronous to synchronous replication, and vice versa.

Each of the storage systems 102 is illustratively associated with a corresponding set of one or more of the host devices 101. The host devices 101 illustratively comprise servers or other types of computers of an enterprise computer system, cloud-based computer system or other arrangement of multiple compute nodes associated with respective users.

The host devices 101 in some embodiments illustratively provide compute services such as execution of one or more applications on behalf of each of one or more users associated with respective ones of the host devices. Such applications illustratively generate input-output (IO) operations that are processed by a corresponding one of the storage systems 102. The term “input-output” as used herein refers to at least one of input and output. For example, IO operations may comprise write requests and/or read requests directed to logical addresses of a particular logical storage volume of a given one of the storage systems 102. These and other types of IO operations are also generally referred to herein as IO requests.

The storage systems 102 illustratively comprise respective processing devices of one or more processing platforms. For example, the storage systems 102 can each comprise one or more processing devices each having a processor and a memory, possibly implementing virtual machines and/or containers, although numerous other configurations are possible.

The storage systems 102 can additionally or alternatively be part of cloud infrastructure such as an Amazon Web Services (AWS) system. Other examples of cloud-based systems that can be used to provide at least portions of the storage systems 102 include Google Cloud Platform (GCP) and Microsoft Azure.

The storage systems 102 may be implemented on a common processing platform, or on separate processing platforms.

The host devices 101 are illustratively configured to write data to and read data from the storage systems 102 in accordance with applications executing on those host devices for system users.

The term “user” herein is intended to be broadly construed so as to encompass numerous arrangements of human, hardware, software or firmware entities, as well as combinations of such entities. Compute and/or storage services may be provided for users under a Platform-as-a-Service (PaaS) model, an Infrastructure-as-a-Service (IaaS) model and/or a Function-as-a-Service (FaaS) model, although it is to be appreciated that numerous other cloud infrastructure arrangements could be used. Also, illustrative embodiments can be implemented outside of the cloud infrastructure context, as in the case of a stand-alone computing and storage system implemented within a given enterprise.

The network 104 is assumed to comprise a portion of a global computer network such as the Internet, although other types of networks can be part of the network 104, including a wide area network (WAN), a local area network (LAN), a satellite network, a telephone or cable network, a cellular network, a wireless network such as a WiFi or WiMAX network, or various portions or combinations of these and other types of networks. The network 104 in some embodiments therefore comprises combinations of multiple different types of networks each comprising processing devices configured to communicate using Internet Protocol (IP) or other communication protocols.

As a more particular example, some embodiments may utilize one or more high-speed local networks in which associated processing devices communicate with one another utilizing Peripheral Component Interconnect express (PCIe) cards of those devices, and networking protocols such as InfiniBand, Gigabit Ethernet or Fibre Channel. Numerous alternative networking arrangements are possible in a given embodiment, as will be appreciated by those skilled in the art.

The source storage system 102S comprises a plurality of storage devices 106S and an associated storage controller 108S. The storage devices 106S store storage volumes 110S. The storage volumes 110S illustratively comprise respective logical units (LUNs) or other types of logical storage volumes.

Similarly, the target storage system 102T comprises a plurality of storage devices 106T and an associated storage controller 108T. The storage devices 106T store storage volumes 110T, at least a portion of which represent respective LUNs or other types of logical storage volumes that are replicated from the source storage system 102S to the target storage system 102T in accordance with a synchronous replication process.

The storage devices 106 of the storage systems 102 illustratively comprise solid state drives (SSDs). Such SSDs are implemented using non-volatile memory (NVM) devices such as flash memory. Other types of NVM devices that can be used to implement at least a portion of the storage devices 106 include non-volatile random access memory (NVRAM), phase-change RAM (PC-RAM), magnetic RAM (MRAM), resistive RAM, spin torque transfer magneto-resistive RAM (STT-MRAM), and Intel Optane™ devices based on 3D XPoint™ memory. These and various combinations of multiple different types of NVM devices may also be used. For example, hard disk drives (HDDs) can be used in combination with or in place of SSDs or other types of NVM devices.

However, it is to be appreciated that other types of storage devices can be used in other embodiments. For example, a given storage system as the term is broadly used herein can include a combination of different types of storage devices, as in the case of a multi-tier storage system comprising a flash-based fast tier and a disk-based capacity tier. In such an embodiment, each of the fast tier and the capacity tier of the multi-tier storage system comprises a plurality of storage devices with different types of storage devices being used in different ones of the storage tiers. For example, the fast tier may comprise flash drives while the capacity tier comprises hard disk drives. The particular storage devices used in a given storage tier may be varied in other embodiments, and multiple distinct storage device types may be used within a single storage tier. The term “storage device” as used herein is intended to be broadly construed, so as to encompass, for example, SSDs, HDDs, flash drives, hybrid drives or other types of storage devices.

In some embodiments, at least one of the storage systems 102 illustratively comprises a scale-out all-flash content addressable storage array such as an XtremIO™ storage array from Dell EMC of Hopkinton, Mass. A wide variety of other types of storage arrays can be used in implementing a given one of the storage systems 102 in other embodiments, including by way of example one or more VNX®, VMAX®, Unity™ or PowerMax™ storage arrays, commercially available from Dell EMC. Additional or alternative types of storage products that can be used in implementing a given storage system in illustrative embodiments include software-defined storage, cloud storage, object-based storage and scale-out storage. Combinations of multiple ones of these and other storage types can also be used in implementing a given storage system in an illustrative embodiment.

The term “storage system” as used herein is therefore intended to be broadly construed, and should not be viewed as being limited to content addressable storage systems or flash-based storage systems. A given storage system as the term is broadly used herein can comprise, for example, network-attached storage (NAS), storage area networks (SANs), direct-attached storage (DAS) and distributed DAS, as well as combinations of these and other storage types, including software-defined storage.

In some embodiments, communications between the host devices 101 and the storage systems 102 comprise Small Computer System Interface (SCSI) or Internet SCSI (iSCSI) commands. Other types of SCSI or non-SCSI commands may be used in other embodiments, including commands that are part of a standard command set, or custom commands such as a “vendor unique command” or VU command that is not part of a standard command set. The term “command” as used herein is therefore intended to be broadly construed, so as to encompass, for example, a composite command that comprises a combination of multiple individual commands. Numerous other commands can be used in other embodiments.

For example, although in some embodiments certain commands used by the host devices 101 to communicate with the storage systems 102 illustratively comprise SCSI or iSCSI commands, other embodiments can implement IO operations utilizing command features and functionality associated with NVM Express (NVMe), as described in the NVMe Specification, Revision 1.3, May 2017, which is incorporated by reference herein. Other storage protocols of this type that may be utilized in illustrative embodiments disclosed herein include NVMe over Fabric, also referred to as NVMeoF, and NVMe over Transmission Control Protocol (TCP), also referred to as NVMe/TCP.

The storage controller 108S of source storage system 102S in the FIG. 1 embodiment includes replication control logic 112S and write-via-hash logic 114S. It can also include additional elements, such as a signature generator for generating content-based signatures of respective data pages.

Similarly, the storage controller 108T of target storage system 102T includes replication control logic 112T and write-via-hash logic 114T. The storage controller 108T, like the storage controller 108S, can also include additional elements, such as a signature generator for generating content-based signatures of respective data pages.

The instances of replication control logic 112S and 112T are collectively referred to herein as replication control logic 112. Such replication control logic instances are also referred to herein as individually or collectively comprising at least a portion of a “replication engine” of the system 100.

The replication control logic 112 of the storage systems 102 controls performance of the synchronous replication process carried out between those storage systems, which as noted above in some embodiments further involves at least one of the host devices 101. The data replicated from the source storage system 102S to the target storage system 102T can include all of the data stored in the source storage system 102S, or only certain designated subsets of the data stored in the source storage system 102S, such as particular designated sets of LUNs or other logical storage volumes. Different replication processes of different types can be implemented for different parts of the stored data.

A given storage volume designated for replication from the source storage system 102S to the target storage system 102T illustratively comprises a set of one or more LUNs or other instances of the storage volumes 110S of the source storage system 102S. Each such logical storage volume illustratively comprises at least a portion of a physical storage space of one or more of the storage devices 106S. The corresponding replicated logical storage volume of the storage volumes 110T of the target storage system 102T illustratively comprises at least a portion of a physical storage space of one or more of the storage devices 106T.

The write-via-hash logic 114 of the storage systems 102 is illustratively configured to control the performance of a process for write-via-hash in synchronous replication, such as that shown in the flow diagram of FIG. 4A, possibly supplemented in some embodiments with one or both of the additional related processes shown in FIGS. 4B and 4C. At least one of the host devices 101 in some embodiments can also include one or more instances of write-via-hash logic and possibly also one or more instances of replication control logic and one or more signature generators.

The storage controllers 108 of the storage systems 102 should also be understood to include additional modules and other components typically found in conventional implementations of storage controllers and storage systems, although such additional modules and other components are omitted from the figure for clarity and simplicity of illustration.

It will be assumed for the following description of the FIG. 1 embodiment that there is an ongoing synchronous replication process being carried out between the source storage system 102S and the target storage system 102T in the system 100, utilizing their respective instances of replication control logic 112S and 112T.

An exemplary synchronous replication process more particularly comprises a synchronous replication process in which host writes to a consistency group comprising one or more storage volumes are mirrored from the source storage system 102S to the target storage system 102T as the host writes are made at the source storage system 102S.

Other types of replication arrangements can be used in other embodiments. For example, the storage systems may be configurable to operate in both asynchronous and synchronous replication modes, with transitions between the modes controlled by their respective instances of replication control logic 112S and 112T.

A given such asynchronous replication mode illustratively comprises a cycle-based asynchronous replication process in which a consistency group comprising one or more storage volumes is replicated from the source storage system 102S to the target storage system 102T over a plurality of asynchronous replication cycles.

Other examples of replication processes that can be used in illustrative embodiments include active-active replication, in which one of the storage systems operates as a “leader” relative to another one of the storage systems operating as a “follower” in implementing consistent synchronous writes to both storage systems. Such active-active replication is considered a type of synchronous replication as that term is broadly used herein.

The system 100 is illustratively configured to provide what is referred to herein as “write-via-hash in synchronous replication.” For example, such write-via-hash in synchronous replication is illustratively performed as part of a replication process carried out between the source storage system 102S and the target storage system 102T. These and other operations related to write-via-hash in synchronous replication as disclosed herein are illustratively implemented at least in part by or otherwise under the control of the source and target instances of write-via-hash logic 114S and 114T. One or more such operations can be additionally or alternatively controlled by one or more other system components in other embodiments.

In accordance with the functionality for write-via-hash in synchronous replication, the storage controller 108S of source storage system 102S is configured, in conjunction with synchronous replication of at least one logical storage volume between the source and target storage systems 102S and 102T, to receive a synchronous write request comprising a data page to be written to the logical storage volume, to determine a content-based signature for the data page, to send the content-based signature from the source storage system 102S to the target storage system 102T, and responsive to receipt in the source storage system 102S of an indication from the target storage system 102T that the data page having the content-based signature is not already present in the target storage system 102T, to send the data page from the source storage system 102S to the target storage system 102T.

These source-side operations are repeated for each of one or more additional synchronous write requests of the logical storage volume that are received in conjunction with the ongoing synchronous replication.

Such an arrangement is an example of what is referred to herein as “write-via-hash” in synchronous replication of one or more logical storage volumes from source storage system 102S to target storage system 102T. The term “write-via-hash” as used herein is intended to be broadly construed, and should not be viewed as being limited to use with full hash digests or other particular types of content-based signatures.

The source storage system 102S and target storage system 102T are examples of what are more generally referred to herein as respective “first and second storage systems.” In other embodiments, the designation of first and second storage systems as respective source and target storage systems can be reversed. For example, a given write request received in conjunction with synchronous replication, also referred to herein as a synchronous write request, or as simply a “host write,” is generally written to one side of the pair of first and second storage systems before it is written to the other. In some embodiments, the host write is first written to the source, and then replicated to the target. However, in other embodiments, the host write is first written to the target, and then replicated to the source. These and other embodiments can be configured to utilize write-via-hash functionality as disclosed herein.

The content-based signature for the data page is illustratively determined based at least in part on application of a secure hashing algorithm to content of the data page. In some embodiments the source storage system 102S already has access to the full hash digest for that page and therefore does not need to compute it or read it from persistent storage in order to determine the full hash digest. For example, the source storage system 102S can receive the full hash digest of the data page along with the data page itself as part of the synchronous write request. As another example, the source storage system 102S can determine the hash digest by accessing an address-to-hash or A2H table that stores logical addresses of the pages in association with respective hashes of the pages, with the respective hashes being generated by applying a secure hashing algorithm to content of the pages, as described in more detail elsewhere herein. Other techniques can be used to determine content-based signatures for respective pages associated with synchronous write requests in other embodiments.

A given write-via-hash attempt initiated by the source storage system 102S for a synchronization write request may be successful, in that the target storage system 102T already has the corresponding data page. In this case, the target storage system 102T responsive to determining that the data page having the content-based signature is already present in the target storage system 102T completes the synchronous write request in the target storage system 102T utilizing the content-based signature.

Alternatively, a given write-via-hash attempt initiated by the source storage system 102S for a synchronization write request may be unsuccessful, in that the target storage system 102T does not already have the corresponding page. In this case, the source storage system 102S sends the data page, and the target storage system 102T responsive to receipt of the data page from the source storage system 102S completes the synchronous write request in the target storage system 102T utilizing the received data page.

The synchronous replication in some embodiments more particularly comprises a plurality of synchronous replication sessions each involving one or more logical storage volumes. Different ones of the synchronous replication sessions are illustratively assigned different ones of a plurality of distinct priority levels.

In these and other embodiments, each of the synchronous replication sessions independently determines whether or not to first send a content-based signature for a data page of a synchronous write request to the target storage system 102T instead of first sending the data page, in order to determine if the data page already exists in the target storage system 102T so as to thereby potentially avoid sending the data page.

In some embodiments, different deduplication thresholds are assigned to different ones of the synchronous replication sessions, possibly based at least in part on relative priorities of those sessions.

Each of one or more of the synchronous replication sessions in some embodiments is further configured to initially process a designated amount of its synchronous write requests by first sending content-based signatures for respective data pages of the synchronous write requests to the target storage system 102T instead of first sending the data pages, in order to determine if the data pages already exist in the target storage system 102T so as to thereby potentially avoid sending the data pages. The session determines an initial value of a deduplication ratio based at least in part on results of the initial processing, and for each of a plurality of additional synchronous write requests, operates as follows:

1. Responsive to a current value of the deduplication ratio being above the deduplication threshold, first sending a content-based signature for a data page of the synchronous write request to the target storage system 102T instead of first sending the data page, in order to determine if the data page already exists in the target storage system 102T so as to thereby potentially avoid sending the data page.

2. Responsive to a current value of the deduplication ratio not being above the deduplication threshold, first sending the data page.

As indicated above, the deduplication thresholds are illustratively assigned to respective ones of the synchronous replication sessions based at least in part on their respective priority levels such that a session having a relatively high priority is assigned a relatively high deduplication threshold.

Various adjustments can be made by the source storage system 102S to the deduplication thresholds over time. For example, one or more of the deduplication thresholds may be reduced responsive to a detected increase in network congestion between the source storage system 102S and the target storage system 102T.

In some embodiments, the source storage system 102S comprises a distributed storage system having a plurality of storage nodes, and each of at least a subset of the storage nodes comprises a set of processing modules configured to communicate with corresponding sets of processing modules on other ones of the storage nodes. A given such set of processing modules illustratively comprises, for example, at least a routing module, a control module and a data module, with the sets of processing modules of the storage nodes collectively comprising at least a portion of a distributed storage controller of the distributed storage system. Illustrative distributed CAS system embodiments of this type are described in more detail in conjunction with FIGS. 2 and 3 below.

A distributed implementation of source storage system 102S as described above is illustratively configured to determine a number of parallel synchronous write requests that can be collectively supported by the routing modules, to determine a replication budget for each of the control modules as a function of the number of parallel synchronous write requests, to allocate portions of the replication budget across the synchronous replication sessions in accordance with their respective priority levels, and to assign synchronous write requests to respective ones of the synchronous replication sessions in accordance with their respective allocated portions of the replication budget.

In such an embodiment, at least one of the synchronous replication sessions that is currently operating below its allocated portion of the replication budget is permitted to obtain one or more synchronous write requests from another one of the synchronous replication sessions for processing. Arrangements of this type are also referred to herein as involving one session “stealing” writes from one or more other sessions.

The above-described operations associated with write-via-hash in synchronous replication are illustratively performed at least in part by or under the control of the replication control logic 112S operating in cooperation with the write-via-hash logic 114S.

More detailed illustrations of example processes for write-via-hash in synchronous replication for other embodiments implementing at least some of the above-described operations will be described below, including the example processes presented in the flow diagrams of FIGS. 4A, 4B and 4C.

It should be noted that the above-noted functionality for write-via-hash in synchronous replication described with reference to source storage system 102S relative to target storage system 102T can additionally or alternatively be implemented in target storage system 102T relative to source storage system 102S. The storage systems 102 in some embodiments therefore both implement substantially the same functionality for write-via-hash in synchronous replication via their respective instances of write-via-hash logic 114. Accordingly, designation of one of the storage systems 102 as the “source” and the other as the “target” can be reversed in other embodiments.

One or both of the storage systems 102 are illustratively implemented as respective distributed storage systems, also referred to herein as clustered storage systems, in which each such storage system comprises a plurality of storage nodes each comprising a set of processing modules configured to communicate with corresponding sets of processing modules on other ones of the storage nodes. The sets of processing modules of the storage nodes of the source storage system collectively comprise at least a portion of the storage controller 108S or storage controller 108T of the respective source storage system 102S or target storage system 102T. For example, in some embodiments the sets of processing modules of the storage nodes collectively comprise a distributed storage controller of the distributed storage system.

The source and target storage systems 102 in some embodiments comprise respective content addressable storage systems in which logical addresses of data pages are mapped to physical addresses of the data pages using respective content-based signatures that are generated from those data pages, as will now be described in more detail with reference to the illustrative embodiments of FIGS. 2 and 3.

FIG. 2 shows an example of a distributed content addressable storage (CAS) system 205 that illustratively represents a particular implementation of one of the source and target storage systems of FIG. 1 in some embodiments, and accordingly is assumed to be coupled to the other one of the storage systems 102 and to one or more host devices of a computer system within information processing system 100. The other storage system illustratively comprises another instance of CAS system 205.

The CAS system 205 comprises a plurality of storage devices 206 and an associated storage controller 208. The storage devices 206 store data of a plurality of storage volumes. The storage volumes illustratively comprise respective LUNs or other types of logical storage volumes. The stored data comprises metadata pages 220 and user data pages 222, both described in more detail elsewhere herein. The storage devices 206 and storage controller 208 are distributed across multiple storage nodes 215. The CAS system 205 can include additional components, such as a write cache and a write cache journal, each also illustratively distributed across the storage nodes 215 of the CAS system 205.

The CAS system 205 is illustratively implemented as a distributed storage system, also referred to herein as a clustered storage system, in which each of at least a subset of the storage nodes 215 comprises a set of processing modules configured to communicate with corresponding sets of processing modules on other ones of the storage nodes 215. The sets of processing modules of the storage nodes of the CAS system 205 collectively comprise at least a portion of the storage controller 208 of the CAS system 205. For example, in some embodiments the sets of processing modules of the storage nodes collectively comprise a distributed storage controller of the CAS system 205. A “distributed storage system” as that term is broadly used herein is intended to encompass any storage system that, like the CAS system 205, is distributed across multiple storage nodes.

Although it is assumed that both the source storage system 102S and the target storage system 102T are content addressable storage systems in some embodiments, other types of storage systems can be used for one or both of the source storage system 102S and the target storage system 102T in other embodiments. For example, it is possible that at least one of the storage systems 102 in an illustrative embodiment need not be a content addressable storage system and need not include an ability to generate content-based signatures. In an embodiment of this type, the signature generation functionality can be implemented in a host device.

The storage controller 208 in the present embodiment is configured to implement functionality for write-via-hash in synchronous replication of the type previously described in conjunction with FIG. 1. For example, the CAS system 205 illustratively participates as a source storage system in a replication process with a target storage system that is implemented as another instance of the CAS system 205.

The storage controller 208 includes distributed modules 212 and 214, which are configured to operate in a manner similar to that described above for respective corresponding replication control logic 112 and write-via-hash logic 114 of the storage controllers 108 of system 100. Module 212 is more particularly referred to as distributed replication control logic, and illustratively comprises multiple replication control logic instances on respective ones of the storage nodes 215, with the multiple replication control logic instances comprising at least a portion of a replication engine configured to perform process operations associated with synchronous replication. Module 214 more particularly comprises distributed write-via-hash logic with different instances thereof also being implemented on respective ones of the storage nodes 215. Each of the storage nodes 215 of the CAS system 205 is assumed to be implemented using at least one processing device comprising a processor coupled to a memory.

In the CAS system 205, logical addresses of data pages are mapped to physical addresses of the data pages using respective content-based signatures that are generated from those data pages. The data pages illustratively include user data pages 222. Metadata pages 220 are typically handled in a different manner, as will be described.

The term “page” as used in this and other contexts herein is intended to be broadly construed so as to encompass any of a wide variety of different types of blocks that may be utilized in a block storage device of a storage system. Different native page sizes are generally utilized in different storage systems of different types. For example, XtremIO™ X1 storage arrays utilize a native page size of 8 kilobytes (KB), while XtremIO™ X2 storage arrays utilize a native page size of 16 KB. Larger native page sizes of 64 KB and 128 KB are utilized in VMAX® V2 and VMAX® V3 storage arrays, respectively. The native page size generally refers to a typical page size at which the storage system ordinarily operates, although it is possible that some storage systems may support multiple distinct page sizes as a configurable parameter of the system. Each such page size of a given storage system may be considered a “native page size” of the storage system as that term is broadly used herein.

A given “page” as the term is broadly used herein should therefore not be viewed as being limited to any particular range of fixed sizes. In some embodiments, a page size of 8 KB is used, but this is by way of example only and can be varied in other embodiments. For example, page sizes of 4 KB, 16 KB or other values can be used. Accordingly, illustrative embodiments can utilize any of a wide variety of alternative paging arrangements for organizing data pages of the CAS system 205.

Also, the term “storage volume” as used herein is intended to be broadly construed, and should not be viewed as being limited to any particular format or configuration.

The content-based signatures utilized in some embodiments illustratively comprise respective hash digests of respective data pages of a storage volume. A given one of the hash digests is generated in illustrative embodiments by applying a secure hashing algorithm to content of a corresponding one of the data pages of the storage volume. For example, a given hash digest can be generated by application of a hash function such as the well-known Secure Hashing Algorithm 1 (SHA1) to the content of its corresponding data page. Other types of secure hashing algorithms, such as SHA2 or SHA256, or more generally other hash functions, can be used in generating content-based signatures herein.

A given hash digest in illustrative embodiments is unique to the particular content of the page from which it is generated, such that two pages with exactly the same content will have the same hash digest, while two pages with different content will have different hash digests. It is also possible that other types of content-based signatures may be used, such as hash handles of the type described elsewhere herein. A hash handle generally provides a shortened representation of its corresponding hash digest. More particularly, the hash handles are shorter in length than respective hash digests that are generated by applying a secure hashing algorithm to respective ones of the data pages. Hash handles are considered examples of “content-based signatures” as that term is broadly used herein.

As indicated above, the storage controller 208 in this embodiment is implemented as a distributed storage controller that comprises sets of processing modules distributed over the storage nodes 215. The storage controller 208 is therefore an example of what is more generally referred to herein as a distributed storage controller.

It is assumed in some embodiments that the processing modules of the storage controller 208 are interconnected in a full mesh network, such that a process of one of the processing modules can communicate with processes of any of the other processing modules. Commands issued by the processes can include, for example, remote procedure calls (RPCs) directed to other ones of the processes.

The sets of processing modules of the storage controller 208 illustratively comprise control modules 208C, data modules 208D, routing modules 208R and at least one management module 208M. Again, these and possibly other processing modules of the storage controller 208 are illustratively interconnected with one another in the full mesh network, such that each of the modules can communicate with each of the other modules, although other types of networks and different module interconnection arrangements can be used in other embodiments.

The management module 208M of the distributed storage controller in this embodiment may more particularly comprise a system-wide management module, also referred to herein as a system manager. Other embodiments can include multiple instances of the management module 208M implemented on different ones of the storage nodes 215. It is therefore assumed that the storage controller 208 comprises one or more management modules 208M.

A wide variety of alternative configurations of nodes and processing modules are possible in other embodiments. Also, the term “storage node” as used herein is intended to be broadly construed, and may comprise a node that implements storage control functionality but does not necessarily incorporate storage devices.

The processing modules of the storage controller 208 as disclosed herein utilize metadata structures that include logical layer and physical layer mapping tables to be described below. It is to be appreciated that these particular tables are only examples, and other tables or metadata structures having different configurations of entries and fields can be used in other embodiments. The logical layer and physical layer mapping tables in this embodiment illustratively include the following:

1. An address-to-hash (“A2H”) table. The A2H table illustratively comprises a plurality of entries accessible utilizing logical addresses as respective keys, with each such entry of the A2H table comprising a corresponding one of the logical addresses, a corresponding one of the hash handles, and possibly one or more additional fields. In some embodiments, the A2H table is assumed to comprise full hash digests in place of or in addition to hash handles. Other configurations are possible, and the term “address-to-hash table” as used herein is therefore intended to be broadly construed.

2. A hash-to-data (“H2D”) table. The H2D table illustratively comprises a plurality of entries accessible utilizing hash handles as respective keys, with each such entry of the H2D table comprising a corresponding one of the hash handles, a physical offset of a corresponding one of the data pages, and possibly one or more additional fields. Again, full hash digests can be used in place of or in addition to hash handles.

3. A hash metadata (“HMD”) table. The HMD table illustratively comprises a plurality of entries accessible utilizing hash handles as respective keys. Each such entry of the HMD table comprises a corresponding one of the hash handles, a corresponding reference count and a corresponding physical offset of one of the data pages. A given one of the reference counts denotes the number of logical pages in the storage system that have the same content as the corresponding data page and therefore point to that same data page via their common hash digest. The HMD table illustratively comprises at least a portion of the same information that is found in the H2D table. Accordingly, in other embodiments, those two tables can be combined into a single table, illustratively referred to as an H2D table, an HMD table or another type of physical layer mapping table providing a mapping between hash values, such as hash handles or hash digests, and corresponding physical addresses of data pages.

4. A physical layer based (“PLB”) table. The PLB table illustratively comprises a plurality of entries accessible utilizing physical offsets as respective keys, with each such entry of the PLB table comprising a corresponding one of the physical offsets, a corresponding one of the hash digests, and possibly one or more additional fields.

As indicated above, the hash handles are generally shorter in length than the corresponding hash digests of the respective data pages, and each illustratively provides a short representation of the corresponding full hash digest. For example, in some embodiments, the full hash digests are 20 bytes in length, and their respective corresponding hash handles are illustratively only 4 or 6 bytes in length. Hash digests can be used in place of in addition to hash handles in some embodiments.

Again, the logical layer and physical layer mapping tables referred to above are examples only, and can be varied in other embodiments. For example, other types of hash-to-physical (“H2P”) mapping tables may be used in addition to or in place of the above-noted H2D, HMD and/or PLB tables.

In some embodiments, certain ones of the above-described mapping tables are maintained by particular modules of storage controller 208. For example, the mapping tables maintained by the control modules 208C illustratively comprise at least one A2H table and possibly also at least one H2D table. The A2H tables are utilized to store address-to-hash mapping information and the H2D tables are utilized to store hash-to-data mapping information, in support of mapping of logical addresses for respective pages to corresponding physical addresses for those pages via respective hashes or other types of content-based signatures, as described in further detail elsewhere herein.

The control modules 208C may further comprise additional components such as respective messaging interfaces that are utilized by the control modules 208C to process routing-to-control messages received from the routing modules 208R, and to generate control-to-routing messages for transmission to the routing modules 208R. Such messaging interfaces can also be configured to process instructions and other messages received from the management module 208M and to generate messages for transmission to the management module 208M.

The data modules 208D comprise respective control interfaces. These control interfaces support communication between the data modules 208D and the control modules 208C. Also included in the data modules are respective SSD interfaces. These SSD interfaces support communications with corresponding ones of the storage devices 206 of the CAS system 205.

The above-described processing module arrangements are presented by way of example only, and can be varied in other embodiments.

In some embodiments, a given data path of the CAS system 205 comprises a particular one of the routing modules 208R, a particular one of the control modules 208C and a particular one of the data modules 208D, each configured to handle different stages of the data path. For example, a given IO request can comprise a read request or a write request received in the particular control module from the particular routing module. The particular control module processes the received IO request to determine the particular data module that has access to the one or more data pages targeted by that IO request.

Communication links may be established between the various processing modules of the storage controller 208 using well-known communication protocols such as TCP/IP and remote direct memory access (RDMA). For example, respective sets of IP links used in data transfer and corresponding messaging could be associated with respective different ones of the routing modules 208R.

In some embodiments, at least portions of the functionality for write-via-hash in synchronous replication in the CAS system are distributed over at least the control modules 208C and data modules 208D of storage controller 208. Numerous other arrangements are possible. For example, portions of the functionality can be implemented in the one or more management modules 208, or using other types and arrangements of modules within or outside of the storage controller 208.

As indicated previously, the storage devices 206 are configured to store metadata pages 220 and user data pages 222, and may also store additional information not explicitly shown such as, for example, one or more system checkpoints and/or snapshots of storage volumes, and one or more write journals such as the write cache journal. The metadata pages 220 and the user data pages 222 in some embodiments are illustratively stored in respective designated metadata and user data areas of the storage devices 206. Accordingly, metadata pages 220 and user data pages 222 may be viewed as corresponding to respective designated metadata and user data areas of the storage devices 206.

As noted above, a given “page” as the term is broadly used herein should not be viewed as being limited to any particular range of fixed sizes. In some embodiments, a page size of 8 KB is used, but this is by way of example only and can be varied in other embodiments. For example, page sizes of 4 KB, 16 KB or other values can be used. Accordingly, illustrative embodiments can utilize any of a wide variety of alternative paging arrangements for organizing the metadata pages 220 and the user data pages 222.

The user data pages 222 are part of a plurality of logical storage volumes configured to store files, blocks, objects or other arrangements of data, each also generally referred to herein as a “data item,” on behalf of users of the CAS system 205. Each such logical storage volume may comprise particular ones of the above-noted user data pages 222 of the user data area. The user data stored in the user data pages 222 can include any type of user data that may be utilized in the system 100. The term “user data” herein is therefore also intended to be broadly construed.

A given storage volume for which content-based signatures are generated, illustratively by signature generators implemented in respective ones of the control modules 208R and/or elsewhere in the storage nodes 215, can comprise a set of one or more LUNs, each including multiple ones of the user data pages 222 stored in storage devices 206.

The CAS system 205 in the embodiment of FIG. 2 is configured to generate hash metadata providing a mapping between content-based digests of respective ones of the user data pages 222 and corresponding physical locations of those pages in the user data area. Content-based digests generated using hash functions are also referred to herein as “hash digests.” Such hash digests or other types of content-based digests are examples of what are more generally referred to herein as “content-based signatures” of the respective user data pages 222. The hash metadata generated by the CAS system 205 is illustratively stored as metadata pages 220 in the metadata area. The generation and storage of the hash metadata is assumed to be performed under the control of the storage controller 208.

Each of the metadata pages 220 characterizes a plurality of the user data pages 222. For example, in a given set of n user data pages representing a portion of the user data pages 222, each of the user data pages is characterized by a volume identifier, an offset and a content-based signature. The content-based signature is generated as a hash function of content of the corresponding user data page. Illustrative hash functions that may be used to generate the content-based signature include the above-noted SHA1 secure hashing algorithm, or other secure hashing algorithms known to those skilled in the art, including SHA2, SHA256 and many others. The content-based signature is utilized to determine the location of the corresponding user data page within the user data area of the storage devices 206.

Each of the metadata pages 220 in the present embodiment is assumed to have a signature that is not content-based. For example, the metadata page signatures may be generated using hash functions or other signature generation algorithms that do not utilize content of the metadata pages as input to the signature generation algorithm. Also, each of the metadata pages is assumed to characterize a different set of the user data pages.

A given set of metadata pages representing a portion of the metadata pages 220 in an illustrative embodiment comprises metadata pages having respective signatures. Each such metadata page characterizes a different set of n user data pages. For example, the characterizing information in each metadata page can include the volume identifiers, offsets and content-based signatures for each of the n user data pages that are characterized by that metadata page. It is to be appreciated, however, that the user data and metadata page configurations described above are examples only, and numerous alternative user data and metadata page configurations can be used in other embodiments.

Ownership of a user data logical address space within the CAS system 205 is illustratively distributed among the control modules 208C.

The functionality for write-via-hash in synchronous replication in the CAS system 205 in this embodiment is assumed to be distributed across multiple distributed processing modules, including at least a subset of the processing modules 208C, 208D, 208R and 208M of the storage controller 208.

For example, the management module 208M of the storage controller 208 may include a write-via-hash logic instance that engages corresponding write-via-hash logic instances in all of the control modules 208C in order to support write-via-hash in synchronous replication in the CAS system 205.

In some embodiments, each of the user data pages 222 has a fixed size such as, for example, 8 KB, and its content-based signature is a 20-byte signature generated using the SHA1 secure hashing algorithm. Also, each page has a volume identifier and an offset, and so is characterized by <lun_id, offset, signature>.

The content-based signature in the present example comprises a content-based digest of the corresponding data page. Such a content-based digest is more particularly referred to as a “hash digest” of the corresponding data page, as the content-based signature is illustratively generated by applying a hash function such as the SHA1 secure hashing algorithm to the content of that data page. The full hash digest of a given data page is given by the above-noted 20-byte signature. The hash digest may be represented by a corresponding “hash handle,” which in some cases may comprise a particular portion of the hash digest. The hash handle illustratively maps on a one-to-one basis to the corresponding full hash digest within a designated cluster boundary or other specified storage resource boundary of a given storage system. In arrangements of this type, the hash handle provides a lightweight mechanism for uniquely identifying the corresponding full hash digest and its associated data page within the specified storage resource boundary. The hash digest and hash handle are both considered examples of “content-based signatures” as that term is broadly used herein.

Examples of techniques for generating and processing hash handles for respective hash digests of respective data pages are disclosed in U.S. Pat. No. 9,208,162, entitled “Generating a Short Hash Handle,” and U.S. Pat. No. 9,286,003, entitled “Method and Apparatus for Creating a Short Hash Handle Highly Correlated with a Globally-Unique Hash Signature,” both of which are incorporated by reference herein.

The storage controller 208 in this example is configured to group consecutive pages into page groups, to arrange the page groups into slices, and to assign the slices to different ones of the control modules 208C. For example, if there are 1024 slices distributed evenly across the control modules 208C, and there are a total of 16 control modules in a given implementation, each of the control modules “owns” 1024/16=64 slices. In such arrangements, different ones of the slices are assigned to different ones of the control modules 208C such that control of the slices within the storage controller 208 of the CAS system 205 is substantially evenly distributed over the control modules 208C of the storage controller 208.

The data modules 208D allow a user to locate a given user data page based on its signature. Each metadata page also has a size of 8 KB and includes multiple instances of the <lun_id, offset, signature> for respective ones of a plurality of the user data pages 222. Such metadata pages 220 are illustratively generated by the control modules 208C but are accessed using the data modules 208D based on a metadata page signature.

The metadata page signature in this embodiment is a 20-byte signature but is not based on the content of the metadata page. Instead, the metadata page signature is generated based on an 8-byte metadata page identifier that is a function of the volume identifier and offset information of that metadata page.

If a user wants to read a user data page having a particular volume identifier and offset, the corresponding metadata page identifier is first determined, then the metadata page signature is computed for the identified metadata page, and then the metadata page is read using the computed signature. In this embodiment, the metadata page signature is more particularly computed using a signature generation algorithm that generates the signature to include a hash of the 8-byte metadata page identifier, one or more ASCII codes for particular predetermined characters, as well as possible additional fields. The last bit of the metadata page signature may always be set to a particular logic value so as to distinguish it from the user data page signature in which the last bit may always be set to the opposite logic value.

The metadata page signature is used to retrieve the metadata page via the data module. This metadata page will include the <lun_id, offset, signature> for the user data page if the user page exists. The signature of the user data page is then used to retrieve that user data page, also via the data module.

Write requests processed in the CAS system 205 each illustratively comprise one or more IO operations directing that at least one data item of the CAS system 205 be written to in a particular manner. A given write request is illustratively received in the CAS system 205 from one of the host devices 101 over network 104. In some embodiments, a write request is received in the storage controller 208 of the CAS system 205, and directed from one processing module to another processing module of the storage controller 208. For example, a received write request may be directed from a routing module 208R of the storage controller 208 to a particular control module 208C of the storage controller 208. Other arrangements for receiving and processing write requests from one or more of the host devices 101 can be used.

The term “write request” as used herein is intended to be broadly construed, so as to encompass one or more IO operations directing that at least one data item of a storage system be written to in a particular manner. A given write request is illustratively received in a storage system from a host device.

In some embodiments, the control modules 208C, data modules 208D and routing modules 208R of the storage nodes 215 communicate with one another over a high-speed internal network such as an InfiniBand network. The control modules 208C, data modules 208D and routing modules 208R coordinate with one another to accomplish various IO processing tasks, as described elsewhere herein.

The write requests from the host devices identify particular data pages to be written in the CAS system 205 by their corresponding logical addresses each illustratively comprising a volume identifier and an offset.

As noted above, a given one of the content-based signatures illustratively comprises a hash digest of the corresponding data page, with the hash digest being generated by applying a hash function to the content of that data page. The hash digest may be uniquely represented within a given storage resource boundary by a corresponding hash handle.

The CAS system 205 illustratively utilizes a two-level mapping process to map logical block addresses to physical block addresses. In some embodiments, the first level of mapping uses an A2H table and the second level of mapping uses an HMD table, with the A2H and HMD tables corresponding to respective logical and physical layers of the content-based signature mapping within the CAS system 205. The HMD table or a given portion thereof in some embodiments disclosed herein is more particularly referred to as an H2D table or H2P table, although it is to be understood that these and other mapping tables or other metadata structures referred to herein can be varied in other embodiments.

The first level of mapping using the A2H table associates logical addresses of respective data pages with respective content-based signatures of those data pages. This is also referred to as logical layer mapping.

The second level of mapping using the HMD table associates respective ones of the content-based signatures with respective physical storage locations in one or more of the storage devices 206. This is also referred to as physical layer mapping.

Examples of these and other metadata structures utilized in illustrative embodiments were described elsewhere herein. These particular examples illustratively include respective A2H, H2D, HMD and PLB tables. In some embodiments, the A2H and H2D tables are utilized primarily by the control modules 208C, while the HMD and PLB tables are utilized primarily by the data modules 208D.

For a given write request, hash metadata comprising at least a subset of the above-noted tables is updated in conjunction with the processing of that write request.

The A2H, H2D, HMD and PLB tables described above are examples of what are more generally referred to herein as “mapping tables” of respective distinct types. Other types and arrangements of mapping tables or other content-based signature mapping information may be used in other embodiments.

Such mapping tables are still more generally referred to herein as “metadata structures” of the CAS system 205. It should be noted that additional or alternative metadata structures can be used in other embodiments. References herein to particular tables of particular types, such as A2H, H2D, HMD and PLB tables, and their respective configurations, should be considered non-limiting and are presented by way of illustrative example only. Such metadata structures can be implemented in numerous alternative configurations with different arrangements of fields and entries in other embodiments.

The logical block addresses or LBAs of a logical layer of the CAS system 205 correspond to respective physical blocks of a physical layer of the CAS system 205. The user data pages of the logical layer are organized by LBA and have reference via respective content-based signatures to particular physical blocks of the physical layer.

Each of the physical blocks has an associated reference count that is maintained within the CAS system 205. The reference count for a given physical block indicates the number of logical blocks that point to that same physical block.

In releasing logical address space in the storage system, a dereferencing operation is generally executed for each of the LBAs being released. More particularly, the reference count of the corresponding physical block is decremented. A reference count of zero indicates that there are no longer any logical blocks that reference the corresponding physical block, and so that physical block can be released.

It should also be understood that the particular arrangement of storage controller processing modules 208C, 208D, 208R and 208M as shown in the FIG. 2 embodiment is presented by way of example only. Numerous alternative arrangements of processing modules of a distributed storage controller may be used to implement algorithms such as those of FIG. 4A, 4B or 4C for providing write-via-hash in synchronous replication in a distributed CAS system or other type of distributed storage system in other embodiments.

Additional examples of content addressable storage functionality that may be implemented in some embodiments by control modules 208C, data modules 208D, routing modules 208R and management module(s) 208M of storage controller 208 can be found in U.S. Pat. No. 9,104,326, entitled “Scalable Block Data Storage Using Content Addressing,” which is incorporated by reference herein. Alternative arrangements of these and other storage node processing modules of a distributed storage controller in a distributed CAS system or other type of distributed storage system can be used in other embodiments.

As indicated above, the CAS system 205 illustratively comprises storage nodes 215 interconnected in a mesh network, with each such storage node comprising a set of processing modules configured communicate with corresponding sets of processing modules on other ones of the storage nodes. A given such set of processing modules comprises at least a routing module, a control module and a data module, with the sets of processing modules of the storage nodes 215 of the CAS system 205 collectively comprising at least a portion of the storage controller 208 of the CAS system 205.

The storage nodes 215 and their respective sets of processing modules are managed by a system manager, illustratively implemented as a management module 208M within the set of processing modules on at least one of the storage nodes 215. Each storage node 215 illustratively comprises a CPU or other type of processor, a memory, a network interface card (NIC) or other type of network interface, and a subset of the storage devices 206, possibly arranged as part of a disk array enclosure (DAE) of the storage node. These and other references to “disks” herein are intended to refer generally to storage devices, including SSDs, and should therefore not be viewed as limited in any way to spinning magnetic media.

An example of the operation of the CAS system 205 in processing IO operations will now be described with reference to FIG. 3, which shows the relationship between routing, control and data modules of one possible distributed implementation of CAS system 205 in an illustrative embodiment. More particularly, FIG. 3 illustrates a portion 300 of the CAS system 205, showing a routing module 208R-x, a control module 208C-y and a data module 208D-z in a distributed implementation of the storage controller 208. The routing module 208R-x, the control module 208C-y and the data module 208D-z are also denoted in this embodiment as an R-module, a C-module and a D-module, respectively.

These modules are respective processing modules of the storage controller 208, and are potentially located on different ones of the storage nodes 215 of the CAS system 205. For example, each of the storage nodes 215 of the CAS system 205 illustratively comprises at least one R-module, at least one C-module and at least one D-module, although many other storage node configurations are possible. In the present embodiment, the routing module 208R-x, the control module 208C-y and the data module 208D-z are assumed to be on respective different storage nodes x, y and z of the CAS system 205. The storage nodes x, y and z represent respective particular ones of the storage nodes 215. The storage node z that implements the D-module 208D-z comprises a subset of the storage devices 206 of the CAS system 205, with the subset of storage devices 206 on storage node z being denoted as storage devices 206-z. Each of the other storage nodes 215 of the CAS system 205 similarly has a different subset of the storage devices 206 associated therewith.

It is assumed in this example that the CAS system 205 manages data using a fixed-size page granularity (e.g., 4 KB, 8 KB or 16 KB), also referred to herein as the native page size of the CAS system 205. A unique hash digest is computed for each of the data pages by a content-based signature generator, illustratively using SHA1 or another secure hashing algorithm of the type described elsewhere herein.

In the CAS system 205, routing modules 208R such as R-module 208R-x illustratively include a storage command parser as shown, such as a SCSI command parser, although other command parsers for other storage protocols can be used in other embodiments. The routing modules 208R receive IO requests from one or more of the host devices 101, parse the corresponding storage commands and route them to the appropriate control modules 208C, which may be located on different storage nodes 215, illustratively using an address-to-control (“A2C”) table. The A2C table maps different portions of a logical address space of the CAS system 205 across different ones of the control modules 208C. A given IO request can be sent by the corresponding one of the host devices 101 to any of the routing modules 208R of the CAS system 205.

The control modules 208C such as control module 208C-y receive the IO requests from the routing modules 208R, and use mapping tables such as the above-described A2H and H2D tables to identify the appropriate data modules 208D that store the corresponding data pages in the distributed CAS system 205. This illustratively includes performing a logical address to hash mapping as shown in the figure.

In processing read requests, the C-module 208C-y retrieves from the A2H table the hash digests of the corresponding requested pages, and sends read requests to the appropriate data modules 208D based on the H2D table.

In processing write requests, the C-module 208C-y illustratively computes the hash digests of the data pages based on the write data, sends write requests to the corresponding data modules 208D as determined from the H2D table, and updates the A2H table.

The data modules 208D such as D-module 208D-z are responsible for the physical storage of the data pages, and use mapping tables such as the above-described HMD and PLB tables and/or other types of H2P tables to determine the physical location of a given data page in the subset of storage devices 206 associated with that data module, using a hash digest, hash handle or other content-based signature supplied by a control module. This illustratively includes performing a hash to physical location mapping as shown in the figure. Such a hash to physical location mapping can utilize an H2P table of the type described elsewhere herein, illustratively comprising at least portions of the above-noted HMD and PLB tables. The data modules 208D in some embodiments additionally store a copy or “mirror” of such metadata in a memory of the respective corresponding storage nodes 215, in order to optimize performance by reducing accesses to the associated storage devices 206 during system operation.

A given one of the host devices 101 illustratively sends an IO request to a particular one of the routing modules 208R, possibly using random selection or another type of algorithm such as round robin to select a particular routing module for a particular IO request. Such selection can be implemented as part of a path selection algorithm performed by a multi-path input-output (MPIO) driver of the host device, in order to select a particular path comprising an initiator-target pair for delivery of the IO request to the CAS system 205. The initiator illustratively comprises a particular host bus adaptor (HBA) of the given host device, and the target illustratively comprises a particular port of the CAS system 205.

The particular features described above in conjunction with FIGS. 2 and 3 should not be construed as limiting in any way, and a wide variety of other distributed implementations of source storage system 102S and target storage system 102T are possible.

Additional details regarding example processes providing write-via-hash functionality in system 100 will be described below with reference to FIGS. 4A, 4B and 4C. It is assumed for these processes that each of the source storage system 102S and the target storage system 102T comprises a corresponding instance of the CAS system 205 of FIG. 2, each with its control, data and routing modules operating in the manner illustrated in FIG. 3.

As indicated previously, in conjunction with synchronous replication, conventional arrangements can create a significant penalty on host writes, by adding delay that increases with link distance, write size and network load.

The write-via-hash functionality provided by illustrative embodiments herein can substantially accelerate host writes in the content of synchronous replication, while also conserving scarce system resources such as network bandwidth. Moreover, such embodiments can balance the needs of multiple synchronous replication sessions with currently-available network bandwidth, taking into consideration their respective distinct deduplication rates and their associated potential savings from use of write-via-hash.

The above-described operations carried out in conjunction with a process for write-via-hash in synchronous replication involving the storage systems 102 are illustratively performed at least in part under the control of the replication engine comprising the multiple instances of replication control logic 112, utilizing instances of write-via-hash logic 114. Additional or alternative operations may be used in such a process in other embodiments. Also, the ordering of the operations can be varied, and different portions of the process can be performed at least in part in parallel with one another.

The storage systems 102 in the FIG. 1 embodiment are assumed to be implemented using at least one processing platform, with each such processing platform comprising one or more processing devices, and each such processing device comprising a processor coupled to a memory. Such processing devices can illustratively include particular arrangements of compute, storage and network resources.

The storage systems 102 may be implemented on respective distinct processing platforms, although numerous other arrangements are possible. At least portions of their associated host devices may be implemented on the same processing platforms as the storage systems 102 or on separate processing platforms.

The term “processing platform” as used herein is intended to be broadly construed so as to encompass, by way of illustration and without limitation, multiple sets of processing devices and associated storage systems that are configured to communicate over one or more networks. For example, distributed implementations of the system 100 are possible, in which certain components of the system reside in one data center in a first geographic location while other components of the system reside in one or more other data centers in one or more other geographic locations that are potentially remote from the first geographic location. Thus, it is possible in some implementations of the system 100 for the storage systems 102 to reside in different data centers. Numerous other distributed implementations of the storage systems 102 and their respective associated sets of host devices are possible.

Additional examples of processing platforms utilized to implement storage systems and possibly their associated host devices in illustrative embodiments will be described in more detail below in conjunction with FIGS. 5 and 6.

It is to be appreciated that these and other features of illustrative embodiments are presented by way of example only, and should not be construed as limiting in any way.

Accordingly, different numbers, types and arrangements of system components such as host devices 101, storage systems 102, network 104, storage devices 106, storage controllers 108, storage volumes 110, replication control logic 112 and write-via-hash logic 114 can be used in other embodiments.

It should be understood that the particular sets of modules and other components implemented in the system 100 as illustrated in FIGS. 1, 2 and 3 are presented by way of example only. In other embodiments, only subsets of these components, or additional or alternative sets of components, may be used, and such components may exhibit alternative functionality and configurations.

For example, in other embodiments, functionality for write-via-hash in synchronous replication can be implemented in one or more host devices, or partially in a host device and partially in a storage system. Accordingly, illustrative embodiments are not limited to arrangements in which all such functionality is implemented in source and target storage systems or a host device, and therefore encompass various hybrid arrangements in which the functionality is distributed over one or more storage systems and one or more associated host devices, each comprising one or more processing devices.

As another example, it is possible in some embodiments that the source storage system and the target storage system can comprise the same storage system. In such an arrangement, a replication process is illustratively implemented to replicate data from one portion of the storage system to another portion of the storage system. The terms “source storage system” and “target storage system” as used herein are therefore intended to be broadly construed so as to encompass such possibilities.

The operation of the information processing system 100 will now be described in further detail with reference to the flow diagrams of the illustrative embodiments of FIGS. 4A, 4B and 4C, which implement respective different processes associated with write-via-hash in synchronous replication.

The flow diagrams of FIGS. 4A, 4B and 4C more particularly show different aspects of functionality for write-via-hash in synchronous replication in illustrative embodiments. Such functionality is illustratively in the form of three distinct processes, also referred to herein as algorithms, suitable for use together in one embodiment or separately in respective distinct embodiments. These algorithms are implemented by logic instances of one or more storage controllers.

FIG. 4A includes steps 400 through 410, showing an example write-via-hash process illustratively performed by source storage system 102S interacting with target storage system 102T. FIG. 4B includes steps 420 through 432, and shows an example process for controlling the manner in which different synchronous replication sessions carry out write-via-hash for their respective synchronous write requests. FIG. 4C includes steps 440 through 452, and shows an example process for allocating available replication bandwidth among sessions and for permitting some sessions to “steal” writes from others. The processes of FIGS. 4B and 4C are illustratively performed primarily by source storage system 102S.

The processes to be described in conjunction with FIGS. 4A, 4B and 4C are more generally assumed to be performed in conjunction with synchronous replication carried out between first and second storage systems. The synchronous replication can comprise a synchronous replication mode of a replication process that includes both asynchronous and synchronous replication modes with transitions occurring between the modes. The first and second storage systems illustratively comprise respective distributed CAS systems of the type previously described in conjunction with FIGS. 2 and 3.

The first and second storage systems are referred to in the context of FIGS. 4A and 4B as respective “source” and “target” for simplicity. However, as indicated elsewhere herein, the source and target designations are arbitrary, and can be reversed in other embodiments.

Referring initially to FIG. 4A, the following steps are performed by source storage system 102S interacting with target storage system 102T, illustratively via their respective instances of replication control logic 112 and write-via-hash logic 114.

In step 400, the source receives a full-page synchronous write request comprising a data page to be written to a logical storage volume that is subject to synchronous replication from source to target.

In step 402, the source determines a full hash digest for the data page. As the synchronous write request in this embodiment is assumed to be a full-page write, the source illustratively already has access to the full hash digest for that page and therefore does not need to compute it or read it from persistent storage in order to determine the full hash digest. For example, the source can receive the full hash digest of the data page along with the data page itself as part of the synchronous write request.

Alternatively, the source can determine the hash digest by accessing an address-to-hash or A2H table that stores logical addresses of the pages in association with respective hash digests of the pages, with the respective hash digests being generated by applying a secure hashing algorithm to content of the pages, as described in more detail elsewhere herein. The hash digests are examples of what are also referred to herein as “hashes” and more generally referred to herein as “content-based signatures.” Other techniques can be used to determine content-based signatures for respective pages in other embodiments.

In step 404, the source sends the full hash digest to the target. In some embodiments herein, the full hash digest comprises a 20-byte value, generated by applying a secure hashing algorithm such as SHA1 to the data page.

In step 406, a determination is made as to whether or not the source has received an indication from the target that a data page having the same full hash digest sent by the source is already present in the target. If such an indication has not been received by the source from the target, the process moves to step 408, and otherwise moves to step 410.

In step 408, which is reached if the target does not already have a data page with the same full hash digest sent by the source, it is necessary for the source to send the data page to the target, and so the source sends the data page to the target and the target uses the received data page to complete the write request. The synchronous write request in this case therefore completes in the normal manner. The process then returns to step 400 as indicated in order to handle another full-page synchronous write request.

In step 410, which is reached if the target already has a data page with the same full hash digest sent by the source, it is not necessary for the source to send the data page to the target, and so the target completes the write request as a deduplicated write without the source sending the data page. For example, the target illustratively increments a reference count for the data page and updates its metadata structures to indicate that an additional logical address is now pointing to the existing physical data page. The synchronous write request in this case therefore completes without any additional data transfer beyond the full hash digest sent by the source in step 404. The process then returns to step 400 as indicated in order to handle another full-page synchronous write request.

It should be noted that multiple instances of the FIG. 4A process can execute at least in part in parallel with one another in order to handle multiple respective full-page synchronous write requests.

Also, synchronous write requests involving partial pages can be handled using normal synchronous replication techniques, without utilization of write-via-hash, by always sending such partial pages “as is” from source to target in conjunction with processing those synchronous write requests.

In the FIG. 4A algorithm, if the target already has the data page corresponding to the full hash digest sent by the source in step 404, the write-via-hash attempt in step 404 is successful, and the data transfer from source to target is minimal, as only the full hash digest (e.g., 20 bytes) is transmitted from source to target in this case, instead of the full data page (e.g., 8 KB or 16 KB). This conserves substantial link bandwidth.

If the target does not already have the data page corresponding to the full hash digest sent by the source in step 404, the write-via-hash attempt in step 404 is unsuccessful, and the full data page (e.g., 8 KB or 16 KB) needs to be sent in this case, but the additional data transfer attributable to the unsuccessful write-via-hash attempt is nonetheless relatively small (e.g., 20 bytes) as compared to the full data page. The additional link bandwidth expended is therefore minimal, but there is a cost in terms of additional latency, due to an additional round-trip communication delay associated with an unsuccessful write-via-hash attempt.

Turning now to FIG. 4B, the following steps are performed by the source storage system 102S interacting with target storage system 102T, again illustratively via their respective instances of replication control logic 112 and write-via-hash logic 114, in order to control the manner in which different synchronous replication sessions carry out write-via-hash for their respective synchronous write requests.

In step 420, the source establishes multiple synchronous replication sessions for synchronous replication of one or more logical storage volumes to the target.

In step 422, the source assigns deduplication thresholds to respective sessions based on priority. For example, the sessions can have different priorities, with some sessions having relatively high priorities and some relatively low priorities. The priorities can be specified by a numerical parameters, such as a particular value in a range. As a more particular example, a range from 1 to 10 may be used, where 1 is the lowest priority and 10 is the highest. The different deduplication thresholds are assigned to the sessions in accordance with such relative priorities. For example, the deduplication thresholds can be specified as respective percentage values, with a given such percentage value indicating a particular level of data page deduplication that must be achieved in order for the corresponding session to select utilization of write-via-hash, beyond its initial use of write-via-hash for a designated amount of synchronous write requests. Sessions with higher priority are illustratively assigned higher deduplication thresholds, such that higher priority sessions are less likely to select utilization of write-via-hash than lower-priority sessions, as higher deduplication thresholds are harder to meet than lower deduplication thresholds. For example, a session with the highest priority can have a deduplication threshold of 100%, such that it practically never selects utilization of write-via-hash.

The assignment of deduplication thresholds to respective sessions in step 422, in addition to or in place of considering session priority as described above, can consider other factors, such as the available replication bandwidth. For example, the deduplication thresholds can be reduced in the presence of network congestion. Under such conditions, even a high priority session can be assigned a lower deduplication threshold, such as 30%, so that if at least 30% of its synchronous writes are to duplicate pages, the write-via-hash algorithm is utilized. This means that this session may approximately 30% of the bandwidth that it would have otherwise utilized by avoiding selection of write-via-hash due to a very high deduplication threshold, and thereby make additional bandwidth resources available for all sessions.

In step 424, the source initially uses write-via-hash for a designated amount of the synchronous write requests in each session and maintains a corresponding deduplication ratio for each session. The write-via-hash is carried out for those synchronous write requests in the manner previously described in conjunction with FIG. 4A. For example, in some embodiments, the source initially makes write-via-hash attempts for only a relatively small percentage of the full-page synchronous write requests, such as 0.1% of those requests, although other percentages can be used. Such an arrangement helps to establish a deduplication ratio for each session, illustratively representing the percentage of synchronous write requests of that session that were successfully completed using write-via-hash only.

In step 426, the source receives an additional synchronous write for a given one of the sessions. Such an “additional” synchronous write illustratively refers to another synchronous write request received in the source for processing by the given session, after the above-noted deduplication ratio has been established for that session based on results of at least a portion of the above-noted write-via-hash attempts made for a relatively small percentage of previous synchronous writes of the given session. The deduplication ratio is illustratively maintained over time and therefore is updated periodically as results of the write-via-hash attempts become available. The latest value of the deduplication ratio for the given session is referred to as the current deduplication ratio for that session.

In step 428, a determination is made as to whether or not the current deduplication ratio of the given session is above its assigned deduplication threshold. If the current deduplication ratio of the given session is not above its assigned deduplication threshold, the process moves to step 430, and otherwise moves to step 432.

In step 430, which is reached if the current deduplication session is at or below its assigned deduplication threshold, the source does not utilize write-via-hash for the additional synchronous write for the given session, and instead uses the normal approach which involves sending the data page to the target without first sending the full hash digest of the data page. The process then returns to step 426 to handle another additional synchronous write request, for the same or a different session.

In step 432, which is reached if the current deduplication session is above its assigned deduplication threshold, the source uses write-via-hash for the additional synchronous write for the given session, which involves first sending the full hash digest of the data page to the target, and only sending the data page itself to the target if the target indicates that it does not already have a data page with the full hash digest, in accordance with the algorithm of FIG. 4A. The process then returns to step 426 to handle another additional synchronous write request, for the same or a different session.

It should be noted that multiple instances of the FIG. 4B process can execute at least in part in parallel with one another in order to handle multiple respective full-page synchronous write requests for each of the multiple sessions.

Again, synchronous write requests involving partial pages can be handled using normal synchronous replication techniques, without utilization of write-via-hash, by always sending such partial pages “as is” from source to target in conjunction with processing those synchronous write requests.

In the FIG. 4B algorithm, each session independently determines whether or not to increase its own latency by attempting write-via-hash for its synchronous write requests, based on its achieved deduplication ratio relative to its assigned deduplication threshold, in exchange for reducing its bandwidth consumption and thereby making additional bandwidth resources available for all sessions.

FIG. 4C illustrates an algorithm for allocating processing bandwidth among the multiple synchronous replication sessions. The multiple synchronous replication sessions are illustratively the same sessions established in step 420 of FIG. 4B, although they could alternatively be different sessions. The FIG. 4C algorithm illustratively allocates available bandwidth across the sessions in accordance with their respective priorities.

In step 440, the source determines the number of parallel writes P each R-module 208R can execute, which is illustratively a function of the processing resources available in each of the R-modules.

In step 442, the source determines the total number of possible parallel writes T by computing T=P×N_(R), where N_(R) is the number of R-modules 208R in the source.

In step 444, the source determines the average C-module replication budget B by computing B=T÷N_(C), where N_(C) is the number of C-modules 208C in the source.

In step 446, the source allocates portions of the budget B across multiple synchronous replication sessions based on their relative priorities.

In step 448, a determination is made as to whether or not any session is at or above its allocation while one or more other sessions are below their respective allocations. Responsive to a negative determination, the process moves to step 450, and otherwise moves to step 452 as indicated.

In step 450, which is reached if there is no session that is at or above its allocation while one or more other sessions are below their respective allocations, the sessions continue to operate in accordance with their respective allocations, and the process returns to step 446 to permit the source to make any needed adjustments in those allocations. For example, the allocations may be adjusted based on changes in the respective priorities of the sessions and/or other factors such as an increase or decrease in the number of sessions.

In step 452, which is reached if there is at least one session that is at or above its allocation while one or more other sessions are below their respective allocations, the source permits at least one session that is at or above its allocation to obtain one or more writes from one or more other sessions that are below their respective allocations. The process then returns to step 446 to permit the source to make any needed adjustments in those allocations.

As an illustration of the operation of the FIG. 4C algorithm, consider an embodiment in the synchronous replication budget B determined in step 446 is 100 synchronous replication writes per second. This is also referred to as the replication bandwidth of the source, in terms of number of write requests. If the source receives fewer than 100 write requests per second, any unused portions of the replication bandwidth are wasted. The FIG. 4C algorithm advantageously avoids any such wasting of replication bandwidth. More particularly, assuming that the above-noted replication budget B of 100 writes per second is divided among the sessions as shown in FIG. 4C, it is beneficial for the source to allow a first session that is at or above its allocation to “steal” one or more writes from a second session that is well below its allocation and is unlikely to need all of its allocated writes.

For example, with a budget B of 100 writes per second and three sessions, two with high priority and one with low priority, the allocation in terms of percent of budget B across the three sessions in step 446 may be 40/40/20. It is assumed that each session can initially only use writes from its allocation. However, if a session is out of budget and there are available writes for other sessions, it can be permitted to obtain up to 20% more but only as long as other sessions are not more than 80% full. In such an arrangement, if current usage across the three sessions is 25/25/20, the third session can obtain 5 writes each from the first and second sessions. Numerous alternative arrangements are possible for budget allocation and for one or more sessions each obtaining additional writes from one or more other sessions.

As another example, consider a first session that is at or above budget, and has a standing request to process a write, for which it has no budget available. Another session has plenty of budget currently unused. For example, there may be a second session with only 50% or less of the budget utilized (i.e., 50% or more unutilized). The first session uses the budget from the second session to process the first session's write. The budget of the second session is decreased, as if it were the second session that processed the write. This “stealing” of budget from the second session by the first session may be allowed only if the unutilized budget of the second session is above a threshold, for example, above 50%. In such cases, it is reasonable to expect that the budget will be replenished before it will be needed.

The particular processing operations and other system functionality described in conjunction with the flow diagrams of FIGS. 4A, 4B and 4C are presented by way of illustrative example only, and should not be construed as limiting the scope of the disclosure in any way.

Alternative embodiments can use other types of processing operations for write-via-hash in synchronous replication. For example, as indicated above, the ordering of the process steps may be varied in other embodiments, or certain steps may be performed at least in part concurrently with one another rather than serially. Also, one or more of the process steps may be repeated periodically, or multiple instances of the process can be performed in parallel with one another in order to implement a plurality of different write-via-hash related processes for respective different replication sessions or for different storage systems or portions thereof within a given information processing system.

Functionality such as that described in conjunction with the flow diagrams of FIGS. 4A, 4B and 4C can be implemented at least in part in the form of one or more software programs stored in memory and executed by a processor of a processing device such as a computer or server. As will be described below, a memory or other storage device having executable program code of one or more software programs embodied therein is an example of what is more generally referred to herein as a “processor-readable storage medium.”

For example, storage controllers such as storage controllers 108 of storage systems 102 that are configured to control performance of one or more steps of the processes of FIGS. 4A, 4B and 4C in system 100 can be implemented as part of what is more generally referred to herein as a processing platform comprising one or more processing devices each comprising a processor coupled to a memory. A given such processing device may correspond to one or more virtual machines or other types of virtualization infrastructure such as Docker containers or Linux containers (LXCs). The storage controllers 108, as well as other system components, may be implemented at least in part using processing devices of such processing platforms. For example, in a distributed implementation of a given one of the storage controllers 108, respective distributed modules of such a storage controller can be implemented in respective containers running on respective ones of the processing devices of a processing platform.

Illustrative embodiments provide techniques for implementing write-via-hash in conjunction with synchronous replication of one or more logical storage volumes from a source storage system to a target storage system. Such techniques can provide a number of significant advantages relative to conventional arrangements.

For example, some embodiments disclosed herein advantageously accelerate host writes and thereby substantially reduce the significant penalties that might otherwise occur for host writes in synchronous replication.

These and other embodiments can help to minimize or otherwise reduce the delays commonly associated with acknowledgment of host writes, attributable to factors such as link distance, write size and network load, leading to improved overall system performance when utilizing synchronous replication.

Moreover, these and other embodiments can balance the needs of multiple synchronous replication sessions with currently-available network bandwidth, taking into consideration their respective distinct deduplication rates and their associated potential savings from use of write-via-hash.

For example, in some embodiments, the disclosed techniques are utilized to provide different levels of Quality of Service (QoS) for different ones of multiple synchronous replication sessions between source and target storage systems, based at least in part on their respective priorities, deduplication ratios and possibly other factors.

Some embodiments advantageously avoid the drawbacks of conventional approaches, such as those that always transmit full data pages, even for low-priority sessions where latency is not particularly important. These embodiments eliminate such wasting of resources, thereby allowing the resources to be utilized by high-priority sessions.

Moreover, illustrative embodiments can avoid any drawbacks that might otherwise be associated with utilizing write-via-hash for all synchronous write requests even when the deduplication ratio is low, thereby potentially eliminating many unnecessary round-trip communications between source and target.

Functionality for write-via-hash in synchronous replication as disclosed herein can be implemented in at least one storage system, in at least one host device, or partially in one or more storage systems and partially in one or more host devices.

It is to be appreciated that the particular advantages described above and elsewhere herein are associated with particular illustrative embodiments and need not be present in other embodiments. Also, the particular types of information processing system features and functionality as illustrated in the drawings and described above are exemplary only, and numerous other arrangements may be used in other embodiments.

Illustrative embodiments of processing platforms utilized to implement host devices and storage systems with functionality for write-via-hash in synchronous replication will now be described in greater detail with reference to FIGS. 5 and 6. Although described in the context of system 100, these platforms may also be used to implement at least portions of other information processing systems in other embodiments.

FIG. 5 shows an example processing platform comprising cloud infrastructure 500. The cloud infrastructure 500 comprises a combination of physical and virtual processing resources that may be utilized to implement at least a portion of the information processing system 100. The cloud infrastructure 500 comprises multiple virtual machines (VMs) and/or container sets 502-1, 502-2, . . . 502-L implemented using virtualization infrastructure 504. The virtualization infrastructure 504 runs on physical infrastructure 505, and illustratively comprises one or more hypervisors and/or operating system level virtualization infrastructure. The operating system level virtualization infrastructure illustratively comprises kernel control groups of a Linux operating system or other type of operating system.

The cloud infrastructure 500 further comprises sets of applications 510-1, 510-2, . . . 510-L running on respective ones of the VMs/container sets 502-1, 502-2, . . . 502-L under the control of the virtualization infrastructure 504. The VMs/container sets 502 may comprise respective VMs, respective sets of one or more containers, or respective sets of one or more containers running in VMs.

In some implementations of the FIG. 5 embodiment, the VMs/container sets 502 comprise respective VMs implemented using virtualization infrastructure 504 that comprises at least one hypervisor. Such implementations can provide functionality for write-via-hash in synchronous replication of the type described above for one or more processes running on a given one of the VMs. For example, each of the VMs can implement replication control logic instances, write-via-hash logic instances, and/or other components for supporting functionality for write-via-hash in synchronous replication in the system 100.

An example of a hypervisor platform that may be used to implement a hypervisor within the virtualization infrastructure 504 is the VMware® vSphere® which may have an associated virtual infrastructure management system such as the VMware® vCenter™. The underlying physical machines may comprise one or more distributed processing platforms that include one or more storage systems.

In other implementations of the FIG. 5 embodiment, the VMs/container sets 502 comprise respective containers implemented using virtualization infrastructure 504 that provides operating system level virtualization functionality, such as support for Docker containers running on bare metal hosts, or Docker containers running on VMs. The containers are illustratively implemented using respective kernel control groups of the operating system. Such implementations can also provide functionality for write-via-hash in synchronous replication of the type described above. For example, a container host device supporting multiple containers of one or more container sets can implement one or more instances of replication control logic, write-via-hash logic and/or other components for supporting functionality for write-via-hash in synchronous replication in the system 100.

As is apparent from the above, one or more of the processing modules or other components of system 100 may each run on a computer, server, storage device or other processing platform element. A given such element may be viewed as an example of what is more generally referred to herein as a “processing device.” The cloud infrastructure 500 shown in FIG. 5 may represent at least a portion of one processing platform. Another example of such a processing platform is processing platform 600 shown in FIG. 6.

The processing platform 600 in this embodiment comprises a portion of system 100 and includes a plurality of processing devices, denoted 602-1, 602-2, 602-3, . . . 602-K, which communicate with one another over a network 604.

The network 604 may comprise any type of network, including by way of example a global computer network such as the Internet, a WAN, a LAN, a satellite network, a telephone or cable network, a cellular network, a wireless network such as a WiFi or WiMAX network, or various portions or combinations of these and other types of networks.

The processing device 602-1 in the processing platform 600 comprises a processor 610 coupled to a memory 612.

The processor 610 may comprise a microprocessor, a microcontroller, an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), graphics processing unit (GPU) or other type of processing circuitry, as well as portions or combinations of such circuitry elements.

The memory 612 may comprise random access memory (RAM), read-only memory (ROM), flash memory or other types of memory, in any combination. The memory 612 and other memories disclosed herein should be viewed as illustrative examples of what are more generally referred to as “processor-readable storage media” storing executable program code of one or more software programs.

Articles of manufacture comprising such processor-readable storage media are considered illustrative embodiments. A given such article of manufacture may comprise, for example, a storage array, a storage disk or an integrated circuit containing RAM, ROM, flash memory or other electronic memory, or any of a wide variety of other types of computer program products. The term “article of manufacture” as used herein should be understood to exclude transitory, propagating signals. Numerous other types of computer program products comprising processor-readable storage media can be used.

Also included in the processing device 602-1 is network interface circuitry 614, which is used to interface the processing device with the network 604 and other system components, and may comprise conventional transceivers.

The other processing devices 602 of the processing platform 600 are assumed to be configured in a manner similar to that shown for processing device 602-1 in the figure.

Again, the particular processing platform 600 shown in the figure is presented by way of example only, and system 100 may include additional or alternative processing platforms, as well as numerous distinct processing platforms in any combination, with each such platform comprising one or more computers, servers, storage devices or other processing devices.

For example, other processing platforms used to implement illustrative embodiments can comprise converged infrastructure such as VxRail™, VxRack™, VxRack™ FLEX, VxBlock™ or Vblock® converged infrastructure from Dell EMC.

It should therefore be understood that in other embodiments different arrangements of additional or alternative elements may be used. At least a subset of these elements may be collectively implemented on a common processing platform, or each such element may be implemented on a separate processing platform.

As indicated previously, components of an information processing system as disclosed herein can be implemented at least in part in the form of one or more software programs stored in memory and executed by a processor of a processing device. For example, at least portions of the functionality for write-via-hash in synchronous replication of one or more components of a storage system as disclosed herein are illustratively implemented in the form of software running on one or more processing devices.

It should again be emphasized that the above-described embodiments are presented for purposes of illustration only. Many variations and other alternative embodiments may be used. For example, the disclosed techniques are applicable to a wide variety of other types of information processing systems, host devices, storage systems, storage nodes, storage devices, storage controllers, replication control logic, write-via-hash logic and other components. Also, the particular configurations of system and device elements and associated processing operations illustratively shown in the drawings can be varied in other embodiments. Moreover, the various assumptions made above in the course of describing the illustrative embodiments should also be viewed as exemplary rather than as requirements or limitations of the disclosure. Numerous other alternative embodiments within the scope of the appended claims will be readily apparent to those skilled in the art. 

1. An apparatus comprising: at least one processing device comprising a processor coupled to a memory; said at least one processing device being configured, in conjunction with synchronous replication of at least one logical storage volume between first and second storage systems: to receive a synchronous write request comprising a data page to be written to the logical storage volume; to determine a content-based signature for the data page; to send the content-based signature from the first storage system to the second storage system; and responsive to receipt in the first storage system of an indication from the second storage system that the data page having the content-based signature is not already present in the second storage system, to send the data page from the first storage system to the second storage system; wherein the synchronous replication comprises a plurality of synchronous replication sessions each involving one or more logical storage volumes; and wherein each of one or more of the synchronous replication sessions has a deduplication threshold and is configured: to initially process a designated amount of its synchronous write requests by first sending content-based signatures for respective data pages of the synchronous write requests to the second storage system instead of first sending the data pages, in order to determine if the data pages already exist in the second storage system so as to thereby potentially avoid sending the data pages; to determine an initial value of a deduplication ratio based at least in part on results of the initial processing; and for each of a plurality of additional synchronous write requests: responsive to a current value of the deduplication ratio being above the deduplication threshold, first sending a content-based signature for a data page of the synchronous write request to the second storage system instead of first sending the data page, in order to determine if the data page already exists in the second storage system so as to thereby potentially avoid sending the data page; and responsive to a current value of the deduplication ratio not being above the deduplication threshold, first sending the data page.
 2. The apparatus of claim 1 wherein said at least one processing device comprises at least a portion of a storage controller of the first storage system.
 3. The apparatus of claim 1 wherein the first and second storage systems comprise respective source and target storage systems of the synchronous replication of said at least one logical storage volume.
 4. The apparatus of claim 1 wherein the content-based signature for the data page is determined based at least in part on application of a secure hashing algorithm to content of the data page.
 5. The apparatus of claim 1 wherein the second storage system responsive to determining that the data page having the content-based signature is already present in the second storage system completes the synchronous write request in the second storage system utilizing the content-based signature.
 6. The apparatus of claim 1 wherein the second storage system responsive to receipt of the data page from the first storage system completes the synchronous write request in the second storage system utilizing the received data page.
 7. The apparatus of claim 1 wherein different ones of the synchronous replication sessions are assigned different ones of a plurality of distinct priority levels.
 8. The apparatus of claim 1 wherein each of the synchronous replication sessions independently determines whether or not to first send a content-based signature for a data page of a synchronous write request to the second storage system instead of first sending the data page, in order to determine if the data page already exists in the second storage system so as to thereby potentially avoid sending the data page.
 9. (canceled)
 10. The apparatus of claim 7 wherein the deduplication thresholds are assigned to respective ones of the synchronous replication sessions based at least in part on their respective priority levels such that a session having a relatively high priority is assigned a relatively high deduplication threshold.
 11. The apparatus of claim 1 wherein one or more of the deduplication thresholds are reduced responsive to a detected increase in network congestion between the first and second storage systems.
 12. The apparatus of claim 1 wherein the first storage system comprises a distributed storage system having a plurality of storage nodes, each of at least a subset of the storage nodes comprising a set of processing modules configured to communicate with corresponding sets of processing modules on other ones of the storage nodes, a given such set of processing modules comprising at least a routing module, a control module and a data module, the sets of processing modules of the storage nodes collectively comprising at least a portion of a distributed storage controller of the distributed storage system.
 13. An apparatus comprising: at least one processing device comprising a processor coupled to a memory; said at least one processing device being configured, in conjunction with synchronous replication of at least one logical storage volume between first and second storage systems: to receive a synchronous write request comprising a data page to be written to the logical storage volume; to determine a content-based signature for the data page; to send the content-based signature from the first storage system to the second storage system; and responsive to receipt in the first storage system of an indication from the second storage system that the data page having the content-based signature is not already present in the second storage system, to send the data page from the first storage system to the second storage system; wherein the synchronous replication comprises a plurality of synchronous replication sessions each involving one or more logical storage volumes; wherein the first storage system comprises a distributed storage system having a plurality of storage nodes, each of at least a subset of the storage nodes comprising a set of processing modules configured to communicate with corresponding sets of processing modules on other ones of the storage nodes, a given such set of processing modules comprising at least a routing module, a control module and a data module, the sets of processing modules of the storage nodes collectively comprising at least a portion of a distributed storage controller of the distributed storage system; and wherein said at least one processing device is further configured: to determine a number of parallel synchronous write requests that can be collectively supported by the routing modules; to determine a replication budget for each of the control modules as a function of the number of parallel synchronous write requests; to allocate portions of the replication budget across the synchronous replication sessions in accordance with respective priority levels assigned thereto; and to assign synchronous write requests to respective ones of the synchronous replication sessions in accordance with their respective allocated portions of the replication budget.
 14. The apparatus of claim 13 wherein at least one of the synchronous replication sessions that is currently operating below its allocated portion of the replication budget is permitted to obtain one or more synchronous write requests from another one of the synchronous replication sessions for processing.
 15. A method comprising: in conjunction with synchronous replication of at least one logical storage volume between first and second storage systems: receiving a synchronous write request comprising a data page to be written to the logical storage volume; determining a content-based signature for the data page; sending the content-based signature from the first storage system to the second storage system; and responsive to receipt in the first storage system of an indication from the second storage system that the data page having the content-based signature is not already present in the second storage system, sending the data page from the first storage system to the second storage system; wherein the synchronous replication comprises a plurality of synchronous replication sessions each involving one or more logical storage volumes; wherein each of one or more of the synchronous replication sessions has a deduplication threshold and is configured: to initially process a designated amount of its synchronous write requests by first sending content-based signatures for respective data pages of the synchronous write requests to the second storage system instead of first sending the data pages, in order to determine if the data pages already exist in the second storage system so as to thereby potentially avoid sending the data pages; to determine an initial value of a deduplication ratio based at least in part on results of the initial processing; and for each of a plurality of additional synchronous write requests: responsive to a current value of the deduplication ratio being above the deduplication threshold, first sending a content-based signature for a data page of the synchronous write request to the second storage system instead of first sending the data page, in order to determine if the data page already exists in the second storage system so as to thereby potentially avoid sending the data page; and responsive to a current value of the deduplication ratio not being above the deduplication threshold, first sending the data page; and wherein the method is implemented by at least one processing device comprising a processor coupled to a memory.
 16. The method of claim 15 wherein different ones of the synchronous replication sessions are assigned different ones of a plurality of distinct priority levels.
 17. The method of claim 15 wherein each of the synchronous replication sessions independently determines whether or not to first send a content-based signature for a data page of a synchronous write request to the second storage system instead of first sending the data page, in order to determine if the data page already exists in the second storage system so as to thereby potentially avoid sending the data page.
 18. A computer program product comprising a non-transitory processor-readable storage medium having stored therein program code of one or more software programs, wherein the program code when executed by at least one processing device causes said at least one processing device, in conjunction with synchronous replication of at least one logical storage volume between first and second storage systems: to receive a synchronous write request comprising a data page to be written to the logical storage volume; to determine a content-based signature for the data page; to send the content-based signature from the first storage system to the second storage system; and responsive to receipt in the first storage system of an indication from the second storage system that the data page having the content-based signature is not already present in the second storage system, to send the data page from the first storage system to the second storage system; wherein the synchronous replication comprises a plurality of synchronous replication sessions each involving one or more logical storage volumes; and wherein each of one or more of the synchronous replication sessions has a deduplication threshold and is configured: to initially process a designated amount of its synchronous write requests by first sending content-based signatures for respective data pages of the synchronous write requests to the second storage system instead of first sending the data pages, in order to determine if the data pages already exist in the second storage system so as to thereby potentially avoid sending the data pages; to determine an initial value of a deduplication ratio based at least in part on results of the initial processing; and for each of a plurality of additional synchronous write requests: responsive to a current value of the deduplication ratio being above the deduplication threshold, first sending a content-based signature for a data page of the synchronous write request to the second storage system instead of first sending the data page, in order to determine if the data page already exists in the second storage system so as to thereby potentially avoid sending the data page; and responsive to a current value of the deduplication ratio not being above the deduplication threshold, first sending the data page.
 19. The computer program product of claim 18 wherein different ones of the synchronous replication sessions are assigned different ones of a plurality of distinct priority levels.
 20. The computer program product of claim 18 wherein each of the synchronous replication sessions independently determines whether or not to first send a content-based signature for a data page of a synchronous write request to the second storage system instead of first sending the data page, in order to determine if the data page already exists in the second storage system so as to thereby potentially avoid sending the data page.
 21. The computer program product of claim 19 wherein the deduplication thresholds are assigned to respective ones of the synchronous replication sessions based at least in part on their respective priority levels such that a session having a relatively high priority is assigned a relatively high deduplication threshold. 